Parametric Verification and Test Coverage for Hybrid Automata Using the Inverse Method
نویسندگان
چکیده
Hybrid systems combine continuous and discrete behavior. Hybrid Automata are a powerful formalism for the modeling and verification of such systems. A common problem in hybrid system verification is the good parameters problem, which consists in identifying a set of parameter valuations which guarantee a certain behavior of a system. Recently, a method has been presented for attacking this problem for Timed Automata. In this paper, we show the extension of this methodology for hybrid automata with linear and affine dynamics. The method is demonstrated with a hybrid system benchmark from the literature.
منابع مشابه
Parametric Verification of Hybrid Automata Using the Inverse Method
Hybrid systems combine continuous and discrete behavior. Hybrid Automata are a powerful formalism for the modeling and verification of such systems. A common problem in hybrid system verification is the good parameters problem, which consists in identifying a subset of parameters which guarantee a certain behavior of a system. Recently, a method has been presented for attacking this problem for...
متن کاملParametric Analysis of Hybrid Systems Using HyMITATOR
Hybrid automata are a powerful formalism for modeling and verifying hybrid systems, that combine continuous and discrete behavior. A common problem for hybrid systems is the good parameters problem, which consists in identifying a set of parameter valuations guaranteeing a certain good behavior of a system. We introduce here HyMITATOR, a tool for efficient parameter synthesis for hybrid automat...
متن کاملSynthesizing Parametric Constraints on Various Case Studies Using IMITATOR II
Introduction Timed automata [1] are finite control automata equipped with clocks, which are real-valued variables which increase uniformly. This model is useful for reasoning about real-time systems with a dense representation of time, because one can specify quantitatively the interval of time during which the transitions can occur, using timing bounds. However, the behavior of a system is ver...
متن کاملAn Extension of the Inverse Method to Probabilistic Timed Automata
Probabilistic timed automata can be used to model systems in which probabilistic and timing behaviour coexist. Verification of probabilistic timed automata models is generally performed with regard to a single reference valuation π0 of the timing parameters. Given such a parameter valuation, we present a method for obtaining automatically a constraint K0 on timing parameters for which the reach...
متن کاملFORMAL VERIFICATION OF CHI MODELS USING PHAVer
The hybrid Chi (χ) language is a formalism for modeling, simulation and verification of hybrid systems. One of the most widely known hybrid system formalisms is that of hybrid automata. The formal translation of χ to hybrid automata enables verification of χ specifications using existing hybrid automata based verification tools. In this paper, we describe the translation from χ to hybrid automa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Int. J. Found. Comput. Sci.
دوره 24 شماره
صفحات -
تاریخ انتشار 2011